Scheduling with two non-unit task lengths is NP-complete
نویسندگان
چکیده
We consider the non-preemptive task scheduling problem with release times and deadlines on a single machine parameterized by the set of task lengths the tasks can have. The identical task lengths case is known to be solvable in polynomial time. We prove that the problem with two task lengths is NP-complete, except for the case in which the short jobs have unit task length, which was already known to be efficiently solvable.
منابع مشابه
On contiguous and non-contiguous parallel task scheduling
In this paper we study differences between contiguous and non-contiguous parallel task schedules. Parallel tasks can be executed on more than one processor simultaneously. In the contiguous schedules indices of the processors assigned to a task must be a sequence of consecutive numbers. In the non-contiguous schedules processor indices may be arbitrary. Nonpreemptive schedules are considered. G...
متن کاملThe complexity of scheduling typed task systems with and without communication delays
We consider the problem of scheduling typed task systems subject to precedence constraints and communication delays. For such task systems, the set of tasks is divided into sets of tasks of the same type and there are di erent types of processors. In a schedule for a typed task system, the type of a task must correspond to the type of the processor on which it is executed. It is proved that if ...
متن کاملRouting and Scheduling File Transfers in Packet-switched Networks | Appendix
THEOREM 1 If G F and G N are both bipartite, les have arbitrary lengths and links have unit speeds, then GFTS1 is NP-complete. Proof This can be proved by a simple reduction from the NP-complete Multiproces-sor Scheduling (MS) problem. In MS, we are given m 2 identical processors, and n independent jobs of lengths p 1 ; p 2 See Figure 3. It is easy to prove that there is a nonpreemptive multipr...
متن کاملPre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems
Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...
متن کاملPre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems
Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1412.3095 شماره
صفحات -
تاریخ انتشار 2014